Ramseyan variations on symmetric subsequences
نویسنده
چکیده
A theorem of Dekking in the combinatorics of words implies that there exists an injective order-preserving transformation f : {0, 1, . . . , n} → {0, 1, . . . , 2n} with the restriction f(i + 1) ≤ f(i) + 2 such that for every 5-term arithmetic progression P its image f(P ) is not an arithmetic progression. In this paper we consider symmetric sets in place of arithmetic progressions and prove lower and upper bounds for the maximum M = M(n) such that every f as above preserves the symmetry of at least one symmetric set S ⊆ {0, 1, . . . , n} with |S| ≥ M .
منابع مشابه
On the Ramseyan Factorization Theorem
We study, in the context of reverse mathematics, the strength of Ramseyan factorization theorem (RFk), a Ramsey-type theorem used in automata theory. We prove that RFk is equivalent to RT 2 2 for all s, k ≥ 2, k ∈ ω over RCA0. We also consider a weak version of Ramseyan factorization theorem and prove that it is in between ADS and CAC.
متن کاملFinite Powers of Strong Measure Zero Sets
In a previous paper – [17] – we characterized strong measure zero sets of reals in terms of a Ramseyan partition relation on certain subspaces of the Alexandroff duplicate of the unit interval. This framework gave only indirect access to the relevant sets of real numbers. We now work more directly with the sets in question, and since it costs little in additional technicalities, we consider the...
متن کاملMining Biological Repetitive Sequences Using Support Vector Machines and Fuzzy SVM
Structural repetitive subsequences are most important portion of biological sequences, which play crucial roles on corresponding sequence’s fold and functionality. Biggest class of the repetitive subsequences is “Transposable Elements” which has its own sub-classes upon contexts’ structures. Many researches have been performed to criticality determine the structure and function of repetitiv...
متن کاملCharacterizations Using Entropies of Records in a Geometric Random Record Model
Suppose that a geometrically distributed number of observations are available from an absolutely continuous distribution function $F$, within this set of observations denote the random number of records by $M$. This is called geometric random record model. In this paper, characterizations of $F$ are provided in terms of the subsequences entropies of records conditional on events ${M geq n}$ or ...
متن کاملOn factorization forests of finite height
Simon (Theoret. Comput. Sci. 72 (1990) 65–94) has proved that every morphism from a free semigroup to a $nite semigroup S admits a Ramseyan factorization forest of height at most 9|S|. In this paper, we prove the same result of Simon with an improved bound of 7|S|. We provide a simple algorithm for constructing a factorization forest. In addition, we show that the algorithm cannot be improved s...
متن کامل